Tight Information Theoretic Converse Results for Some Pliable Index Coding Problems
نویسندگان
چکیده
منابع مشابه
A Deterministic Algorithm for Pliable Index Coding
Pliable index coding considers a server with m messages, and n clients where each has as side information a subset of the messages. We seek to minimize the number of transmissions the server should make, so that each client receives (any) one message she does not already have. Previous work has shown that the server can achieve this using O(log(n)) transmissions and needs at least Ω(log(n)) tra...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Tight bounds for some problems
There are a number of fundamental problems in eomputational geometry for which work-optimal aJgorithDls exist which have a parallel running -fuDe of O(log n) in the PRAM model. These include problems like two and three dimensional convex-hulls, trapeSoidal decomposition, arrangement coDStruc:.tion, dommance among others. Further improvements in running time to sub-logarithmic range were not con...
متن کاملInformation-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder. Motivated by a desire to foster links between control and information theory, we augment the standard formulation by considering general alphabets and a cost function operating on current and previous symbols. Using dy...
متن کاملSome existence results for generalized vector quasi-equilibrium problems
In this paper, we introduce and study a class of generalized vector quasi-equilibrium problem, which includes many vector equilibrium problems, equilibrium problems, vector variational inequalities and variational inequalities as special cases. Using one person game theorems, the concept of escaping sequences and without convexity assumptions, we prove some existence results for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2947669